منابع مشابه
Completeness of Lyapunov Abstraction
In this work, we continue our study on discrete abstractions of dynamical systems. To this end, we use a family of partitioning functions to generate an abstraction. The intersection of sub-level sets of the partitioning functions defines cells, which are regarded as discrete objects. The union of cells makes up the state space of the dynamical systems. Our construction gives rise to a combinat...
متن کاملExpressiveness and Completeness in Abstraction
ion is often a key instrument for turning intractable model checking problems into tractable problems. In the theoretical studies on abstraction frameworks, the expressivity and completeness of the frameworks are the main indicators of the power of the frameworks. A major problem is that the notion of expressiveness of an abstraction framework is not defined unambiguously in the literature. Wei...
متن کاملAbstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba Ölveczky a,b and José Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, University of Illinois at Urbana-Champaign Abstract This paper presents criteria that guarantee completeness of Real-Time Maude search and temporal logic model checking analyses, under the maximal time sampling strategy, for a la...
متن کاملFormal Abstraction of Linear Systems via Polyhedral Lyapunov Functions
In this paper we present an abstraction algorithm that produces a finite bisimulation quotient for an autonomous discrete-time linear system. We assume that the bisimulation quotient is required to preserve the observations over an arbitrary, finite number of polytopic subsets of the system state space. We generate the bisimulation quotient with the aid of a sequence of contractive polytopic su...
متن کاملRelative Completeness of Abstraction Refinement for Software Model Checking
Automated methods for an undecidable class of verification problems cannot be complete (terminate for every correct program). We therefore consider a new kind of quality measure for such methods, which is completeness relative to a (powerful but unrealistic) oraclebased method. More precisely, we ask whether an often implemented method known as “software model checking with abstraction refineme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.124.5